| 翻訳と辞書 |
| large countable ordinal ： ウィキペディア英語版 |
large countable ordinal
(詳細はset theory, there are many ways of describing specific countable ordinals. The smallest ones can be usefully and non-circularly expressed in terms of their Cantor normal forms. Beyond that, many ordinals of relevance to proof theory still have computable ordinal notations. However, it is not possible to decide effectively whether a given putative ordinal notation is a notation or not (for reasons somewhat analogous to the unsolvability of the halting problem); various more-concrete ways of defining ordinals that definitely have notations are available.
Since there are only countably many notations, all ordinals with notations are exhausted well below the first uncountable ordinal ω1; their supremum is called ''Church–Kleene ω1'' or ω1CK (not to be confused with the first uncountable ordinal, ω1), described below. Ordinal numbers below ω1CK are the recursive ordinals (see below). Countable ordinals larger than this may still be defined, but do not have notations.
Due to the focus on countable ordinals, ordinal arithmetic is used throughout, except where otherwise noted. The ordinals described here are not as large as the ones described in large cardinals, but they are large among those that have constructive notations (descriptions). Larger and larger ordinals can be defined, but they become more and more difficult to describe.
== Generalities on recursive ordinals ==
(詳細はウィキペディア（Wikipedia）』
■ウィキペディアで「large countable ordinal」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|